Partial Loss Probability of OVSF Single-code Assignment with Space-limited Batch Arrival Queues: M[2x]/M/c/c
نویسنده
چکیده
In a WCDMA Node-B, orthogonal variable spreading factor (OVSF) codes are both valuable and limited. Many efforts are being made to create OVSF code-assignment schemes that support a maximum number of users. Here the author (a) proposes a batch arrival and partial loss queuing model to evaluate OVSF single-code assignment system performance, and (b) derives expressions for calculating two important system performance measures (partial loss probability and bandwidth utilization) that respectively denote subscriber service quality and operator profit. Results from a simulation test suggest that the proposed model has utility in the construction of WCDMA networks.
منابع مشابه
An Efficient Dynamic Orthogonal Variable Spreading Factor Code Allocation Approach in WCDMA through Modified Adaptive Genetic Algorithm
Orthogonal Variable Spreading Factor (OVSF) codes would give variable data rate transmissions for different bandwidth supplies in Wideband CDMA (WCDMA) networks. These OVSF codes are used for the channelization of codes in WCDMA. In WCDMA, effective utilization of OVSF codes has become an active area of research as the number of codes is very limited. It is a fact that the successor and predece...
متن کاملGenetic approach for dynamic OVSF code allocation in 3G wireless networks
Orthogonal variable spreading factor (OVSF) codes provide variable data rate transmissions for different bandwidth requirements in 3G WCDMA networks. In order to effectively utilize limited OVSF resources, many works in the literature have focused on dynamic code assignment (DCA) schemes. This paper investigates genetic algorithm (GA) based approach for dynamic OVSF code assignment in WCDMA net...
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملANALYSIS OF PARETO/M/s/c QUEUES USING UNIFORMIZATION
Abstract– Uniformization is a powerful numerical technique for the analysis of continuous time Markov chains that possesses a probabilistic interpretation. In this paper, we propose the combination of the embedded Markov chain approach for queues with uniformization to analyze GI/M/s/c queues. The main steps of the procedure are: (1) To compute the mixed-Poisson probabilities associated to the ...
متن کاملCombined code reuse scheme with two-dimensional OVSF codes assignment algorithm for uplink multi-user/multi-rate block spread multi-cellular CDMA
The two-dimensional (2D) block spread code division multiple access (CDMA) can avoid the uplink multiple-access interference with low-complexity single-user detection in a slow fading channel and, therefore, is very attractive. In the 2D spreading, orthogonal variable spreading factor (OVSF) is used for spreading; an important problem is how to efficiently assign the limited resource of OVSF co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 26 شماره
صفحات -
تاریخ انتشار 2010